Bisimulation through probabilistic testing
نویسندگان
چکیده
منابع مشابه
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded programs running under a uniform probabilistic scheduler; it allows the running times of threads to depend on the values of variables, provided that these timing variations cannot affect the values of variables. But these tim...
متن کاملFair Testing through Probabilistic Testing
In this paper we deene a probabilistic testing semantics which can be used to alternatively characterize fair testing. The key idea is to deene a probabilistic semantics in such a way that two non-probabilistic processes are fair equivalent ii any probabilistic version of both processes are equivalent in our probabilistic testing semantics. In order to get this result we deene a simple probabil...
متن کاملPolynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
Various models and equivalence relations or preorders for probabilistic processes are proposed in the literature. This paper deals with a model based on labelled transition systems extended to the prob-abalistic setting and gives an O(n 2 m) algorithm for testing probabilistic bisimulation and an O(n 5 m 2) algorithm for testing probabilistic simulation where n is the number of states and m the...
متن کاملLax Probabilistic Bisimulation
Probabilistic bisimulation is a widely studied equivalence relation for stochastic systems. However, it requires the behavior of the states to match on actions with matching labels. This does not allow bisimulation to capture symmetries in the system. In this thesis we define lax probabilistic bisimulation, in which actions are only required to match within given action equivalence classes. We ...
متن کاملNotes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we consider any process algebra giving rise to a Probabilistic Transition System satisfying the condition of regularity and offering prefixing, interleaving, and guarded recursion, then the coarsest congruence that is contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90030-6